The Frobenius number for sequences of triangular and tetrahedral numbers
نویسندگان
چکیده
منابع مشابه
Sums of Triangular Numbers from the Frobenius Determinant
Abstract. We show that the denominator formula for the strange series of affine superalgebras, conjectured by Kac and Wakimoto and proved by Zagier, follows from a classical determinant evaluation of Frobenius. As a limit case, we obtain exact formulas for the number of representations of an arbitrary number as a sum of 4m2/d triangles, whenever d | 2m, and 4m(m + 1)/d triangles, when d | 2m or...
متن کاملOn Certain Diophantine Equations Related to Triangular and Tetrahedral Numbers
In this paper we give solutions of certain diophantine equations related to triangular and tetrahedral numbers and propose several problems connected with these numbers. The material of this paper was presented in part at the 11th International Workshop for Young Mathematicians NUMBER THEORY, Kraków, 14th20th september 2008.
متن کاملTriangular and tetrahedral spectral elements
In this paper we present a new unstructured spectral element method for use on triangular and tetrahedral subdomains. The algorithm maintains the accuracy and efficiency of standard quadrilateral/hexahedral spectral element methods but offers greater adaptivity. Standard unstructured meshes can be used and the order of the polynomial expansion can be varied within each triangular/tetrahedral su...
متن کاملMultiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes
We study the simplification of triangular and tetrahedral meshes using techniques based on successive edge collapses, as well as the exploitation of the generated multiple levels of detail for the effective processing of the models. Regarding triangular meshes, we present a method for the construction of progressive hulls, by suitable edge collapses; we use the generated hulls for the accelerat...
متن کاملFaster Algorithms for Frobenius Numbers
The Frobenius problem, also known as the postage-stamp problem or the moneychanging problem, is an integer programming problem that seeks nonnegative integer solutions to x1a1 + · · · + xnan = M , where ai and M are positive integers. In particular, the Frobenius number f(A), where A = {ai}, is the largest M so that this equation fails to have a solution. A simple way to compute this number is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2018
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2017.10.014